The Finite Intervals of the Muchnik Lattice
نویسنده
چکیده
We characterize the finite intervals of the Muchnik lattice by proving that they form a certain proper subclass of the finite distributive lattices. We also discuss infinite intervals, mainly to conclude that much more is possible here than for the related Medvedev lattice.
منابع مشابه
Intervals of the Muchnik Lattice
Answering a question raised by Terwijn, we give a lattice-theoretic characterization of the intervals of the Muchnik lattice as a subset of the distributive lattices, valid for all intervals satisfying a cardinality constraint on the size of antichains.
متن کاملOn the Muchnik degrees of 2-dimensional subshifts of finite type
We apply some concepts and results from mathematical logic in order to obtain an apparently new counterexample in symbolic dynamics. Two sets are said to be Muchnik equivalent if any point of either set can be used as a Turing oracle to compute a point of the other set. The Muchnik degree of a set is its Muchnik equivalence class. There is an extensive recursion-theoretic literature on the latt...
متن کاملDegrees of unsolvability of 2-dimensional subshifts of finite type
We apply some concepts and results from mathematical logic in order to obtain an apparently new counterexample in 2-dimensional symbolic dynamics. A set X is said to be Muchnik reducible to a set Y if each point of Y can be used as a Turing oracle to compute a point of X. The Muchnik degree of X is the equivalence class of X under the equivalence relation of mutual Muchnik reducibility. There i...
متن کاملOn the structure of the Medvedev lattice
We investigate the structure of the Medvedev lattice as a partial order. We prove that every interval in the lattice is either finite, in which case it is isomorphic to a finite Boolean algebra, or contains an antichain of size 2 א0 , the size of the lattice itself. We also prove that it is consistent that the lattice has chains of size 2 א0 , and in fact that these big chains occur in every in...
متن کاملThe first order theories of the Medvedev and the Muchnik lattice
We show that the first order theories of the Medevdev lattice and the Muchnik lattice are both computably isomorphic to the third order theory of true arithmetic.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018